linear recurrence sequence

См. также в других словарях:

• Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… …   Wikipedia

• Recurrence period density entropy — (RPDE) is a method, in the fields of dynamical systems, stochastic processes, and time series analysis, for determining the periodicity, or repetitiveness of a signal. Overview Recurrence period density entropy is useful for characterising the… …   Wikipedia

• Linear congruential generator — A linear congruential generator (LCG) represent one of the oldest and best known pseudorandom number generator algorithms. [ [http://demonstrations.wolfram.com/LinearCongruentialGenerators/ Linear Congruential Generators] by Joe Bolte, The… …   Wikipedia

• Sequence alignment — In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.[1]… …   Wikipedia

• Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length …   Wikipedia

• Hofstadter sequence — In mathematics, a Hofstadter sequence is a member of a family of related integer sequences defined by non linear recurrence relations. equences presented in Gödel, Escher, Bach: an Eternal Golden Braid The first Hofstadter sequences were… …   Wikipedia

• Sheffer sequence — In mathematics, a Sheffer sequence is a polynomial sequence, i.e., a sequence { p n ( x ) : n = 0, 1, 2, 3, ... } of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in… …   Wikipedia

• Fibonacci number — A tiling with squares whose sides are successive Fibonacci numbers in length …   Wikipedia

• Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …   Wikipedia

• Mersenne twister — The Mersenne twister is a pseudorandom number generator developed in 1997 by Makoto Matsumoto (松本 眞?) and Takuji Nishimura (西村 拓士?)[1] …   Wikipedia

• Clenshaw algorithm — In numerical analysis, the Clenshaw algorithm[1] is a recursive method to evaluate a linear combination of Chebyshev polynomials. In general it applies to any class of functions that can be defined by a three term recurrence relation.[2] Contents …   Wikipedia